Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems

نویسندگان

  • Lingchen Kong
  • Levent Tunçel
  • Naihua Xiu
چکیده

The implicit Lagrangian was first proposed by Mangasarian and Solodov as a smooth merit function for the nonnegative orthant complementarity problem. It has attracted much attention in the past ten years because of its utility in reformulating complementarity problems as unconstrained minimization problems. In this paper, exploiting the Jordan-algebraic structure, we extend it to the vector-valued implicit Lagrangian for symmetric cone complementarity problem (SCCP), and show that it is a continuously differentiable and strongly semismooth complementarity function for SCCP. As an application, we develop the real-valued implicit Lagrangian and the corresponding smooth merit function for SCCP, and give a necessary and sufficient condition for the stationary point of the merit function to be a solution of SCCP. Finally, we show that this merit function can provide a global error bound for SCCP with the uniform Cartesian P-property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An R-Linearly Convergent Nonmonotone Derivative-Free Method for Symmetric Cone Complementarity Problems

This paper extends the derivative-free descent method [18] for the nonlinear complementarity problem to the symmetric cone complementarity problem (SCCP). The algorithm is based on the unconstrained implicit Lagrangian reformulation of the SCCP, but uses a convex combination of the negative partial gradients of the implicit Lagrangian function ψα, i.e. the vector of the form −θ∇xψα −(1 −θ)∇yψα ...

متن کامل

Growth behavior of two classes of merit functions for symmetric cone complementarity problems

In the solution methods of the symmetric cone complementarity problem (SCCP), the squared norm of a complementarity function serves naturally as a merit function for the problem itself or the equivalent system of equations reformulation. In this paper, we study the growth behavior of two classes of such merit functions, which are induced by the smooth EP complementarity functions and the smooth...

متن کامل

A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs

An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...

متن کامل

Error bounds for symmetric cone complementarity problems

In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...

متن کامل

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • APJOR

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2009